Querying several conflictual databases

This paper addresses the problem of querying several databases considered as a whole. Assuming that the different databases share a common data description language, the problem that raises is to consistently answer queries even if the database contents are contradictory. The main contribution of this paper is the specification of a query-evaluator for answering closed and open queries addressed to several databases. For doing so, we first specify a query-evaluator, in logic, which assumes that the databases are propositional ones and do not contain disjonctions. Then we extend it to first-order databases defined by an extensional part (sets of positive or negative facts) and an intensional part (sets of first order clauses). We also show that the query-evaluator corresponds to a majority merging of the databases.